A visual cryptoGRAPHy scheme based on a given GRAPH G is a method to distribute a secret image among the vertices of G, the participants, so that a subset of participants can recover the secret image if they contain an edge of G, by stacking their shares, otherwise they can obtain no information regarding the secret image. In this paper a maximal independent sets of the GRAPH G was applied to propose a lower bound on the pixel expansion of visual cryptoGRAPHy schemes with GRAPH ACCESS STRUCTURE G (G). In addition a lower bound on the pixel expansion of basis matrices C5 and Peterson GRAPH ACCESS STRUCTURE were presented.

‎The characterization of the ideal ACCESS STRUCTUREs is one of the main open problems in secret sharing and is important from both practical and theoretical points of views‎. ‎A GRAPH-based $3-$homogeneous ACCESS STRUCTURE is an ACCESS STRUCTURE in which the participants are the vertices of a connected GRAPH and every subset of the vertices is a minimal qualified subset if it has three vertices and induces a connected GRAPH‎. ‎In this paper‎, ‎we introduce the GRAPH-based $3-$homogeneous ACCESS STRUCTUREs and characterize the ideal GRAPH-based $3$-homogeneous ACCESS STRUCTUREs‎. ‎We prove that for every non-ideal GRAPH-based $3$-homogeneous ACCESS STRUCTURE over the GRAPH $G$ with the maximum degree $d$ there exists a secret sharing scheme with an information rate $\frac{1}{d+1}$‎. ‎Furthermore‎, ‎we mention three forbidden configurations that are useful in characterizing other families of ideal ACCESS STRUCTUREs‎.

In this paper, we propose a new method for GRAPH summarization named GSSC, GRAPH Summarization based on both STRUCTURE and Concepts. In this method, an attributed GRAPH is summarized by considering both of its topology and related concepts. In this method, for a given attributed GRAPH a new GRAPH is constructed that an edge in this new GRAPH represents structural and conceptual similarity of its two end points. Structural and conceptual similarity of two nodes not necessarily has the equal amount of importance in the weight of the resulting edge. For example, for a special case such as query answering, STRUCTURE can be more important and vice versa. Similarity of two nodes is computed based on Jaccard similarity. This method has some advantages such as flexibility, simplicity, learning capability, user-orientation that makes it a better method for GRAPH summarization. We implemented our method and the method proposed by Bei and evaluated these two methods on real-life dataset HEP_TH. Our experimental results showed effectiveness and efficiency of our proposed method.

Nowadays, the fundamental role of having a purpose for life in physical and mental health has been confirmed. According to victor frankl, presence of a purpose in life gives life a meaning and increases resilience against pains and traumas. The importance of the purpose in life construct reveals the need for a reliable and valid tool to measure it. Crumbaugh and Maholick's purpose in life questionnaire is the first and one of the most applied tools for the assessment of life's purposefulness. The aim of this research is to determine the factor STRUCTURE of purpose in life questionnaire. The questionnaire was administered on 206 students who were selected through random stratified sampling at Ferdowsi University of Mashhad. Exploratory factor analysis showed that there are two factors "comprehension" and "purpose" and this finding were confirmed by confirmatory factor analysis. Altogether results of this research showed factor validity of the purpose in life questionnaire with a two factor pattern

For a set ‎$‎X‎$ ‎and a ‎topological space ‎$‎(X,\tau‎)$, ‎let‎ ‎‎$‎\Gamma_{_X}(\tau)‎$ ‎be a‎ ‎GRAPH ‎with ‎vertex ‎set ‎‎$‎\tau\setminus \{\emptyset,X\}‎$ ‎in ‎which ‎two ‎vertices ‎‎$‎A_1‎$ ‎and ‎‎$‎A_2‎$ ‎are ‎adjacent ‎just ‎when ‎‎$‎A_1\cup A_2=X‎$‎. In this paper and among some other results, we study the maximum and minimum degrees, the matching number, the chromatic number, the chromatic index, ‎the planarity, the Wiener index and the Zagreb index of ‎‎$‎\Gamma_{_X}(\tau)‎$ and we determine their exact values in general cases or in some special topological spaces like ‎$‎T_1‎$‎‎.

Let $R$ be an associative ring and $M$ be a monoid . In this paper , we introduce new kind of GRAPH STRUCTURE asociated with zero-divisors of monoid ring $R[M]$ , calling it the $M$-Armendariz GRAPH of a ring $R$ and denoted by $A(R,M)$ . It is an undirected GRAPH whose vertices are all non-zero zero-divisors of the monoid ring $R[M]$ and two distinct vertices $\alpha=a_{1}g_{1}+\cdots + a_{n}g_{n}$ and $\beta=b_{1}h_{1}+\cdots+b_{m}h_{m}$ are adjacent if and only if $a_{i}b_{j}=0$ or $b_{j}a_{i}=0$ for all $i,j$ . We investigate some GRAPH properties of $A(R,M)$ such as diameter , girth , domination number and planarity . Also , we get some relations between diameters of the $M$-Armendariz GRAPH $A(R,M)$ and that of zero divisor GRAPH $\Gamma(R[M])$ , where $R$ is a reversible ring and $M$ is a unique product monoid .

In this note, we show that automata theory is a suitable tool for analyzing monopoly-forcing processes. Also, we present the notion of mono-forcing automata by using the monopoly-forcing set for GRAPHs. Moreover, we prove that mono-forcing automata accept more languages than zero-forcing finite automata also, we show that all results in zero-forcing finite automata for complete GRAPHs are established for mono-forcing automata. We examine and deliberate on the language associated with mono-forcing automata for certain specified GRAPHs. Also, we present the style of words that can be recognized with mono-forcing automata. Additionally, we delineate the types of words identifiable by mono-forcing automata. We also describe the configuration of GRAPHs from which mono-forcing automata emerge, generating specific languages. Several examples are provided to elucidate these concepts.

Introduction: Landscape fragmentation reduces the patch area of internal habitat, hinders the operating and regulating ability of normal landscape ecological processes, and damages ecological corridors. Therefore, connecting isolated broken ecological patches and stepping stones through potential corridors within the borders can improve the impact of fragmented landscapes on biodiversity and the connectivity of landscape and promote the exchanges of genetic material and species between patches, which would effectively improve the service functions of natural ecosystems and have an important ecological significance. Basically correct landscape pattern requires ecological network and ecological system. Ecological network helps planners to increase the landscape connectivity between habitat patches. Network optimization is mainly based on the improvement in network connectivity, including the optimization of corridors and nodes. The optimization of corridors mainly refers to the increase in the number of corridors and the repair of ecological breakpoints in the corridors based on the degree of connectivity. Corridor connectivity should be increased in areas with low landscape connectivity. In recent years, the morphological spatial pattern analysis (MSPA) approach, which mainly focuses on structural connectivity, has been increasingly applied in ecological network analysis. This model is mainly used for the analysis of structural connectivity and can be used to accurately distinguish between landscape types and STRUCTUREs. The MSPA method applies four parameters, namely “ connectivity” , “ edge width” , “ transition” and “ intext” to classify landscape. Landscape connectivity can be used as a quantitative indicator of how facilitating a source landscape patch is for species migration, as a high degree of connectivity facilitates biodiversity protection and the maintenance of landscape ecological functions. The connectivity of the landscape and the importance of the various landscape patches to landscape connectivity can be reflected under GRAPH. In northern Iranian provinces like Gilan province, cities have experienced irregular and horizontal urban sprawls during recent decades due to the existence of Hyrcanian Forests, special climatic setting, presence of green areas and adjacency to Caspian Sea, high population density, and the development of economic activities across the region. As a result of land-use change, urban growth and land degradation, the distributions of some terrestrial species have changed in recent years. Phasianus colchicus is one of the focal species in this region. Dispersal distance, which is species specific, is a critical process determining the distance threshold. The maximal dispersal distance of the Phasianus colchicus 3. 2. The species prefers forests with canopy cover of 5– 25% because these forests are largely covered by shrubs and bushes, which common pheasant use as a refuge. Pheasants live out their lives within a home range of about one square mile (640 acres), requiring all habitat components (nesting cover, brood habitat, winter cover and food plots) to be in close proximity. Ideally, a minimum of 30-60 acres (about 5-10 percent) of this range should be nesting cover. Larger blocks of cover are preferable to narrow linear strips. In this study, seeking to make a more comprehensive assessment of landscape connectivity, the core habitats and corridors will be identified according to the habitat type and dispersal distance of the focal species. Material and Methods: The study area in this study is located in the two watersheds of Lahijan Chabaksar (49 12 to 50 05 E, 37 07 to 37 25 N) and Astaneh-Kuchesfahan (50 21 to 50 26 E, 37 02 to 37 06 N), in the east and center of Gilan province, respectively. In the first step to classify the land cover in this study, the total Landsat 8 images in the period 01/01/2019 to 31/12/2019, which had a cloud cover below 10%, were used. Then, using Google Earth Engine and the products and instructions of vegetation index (NDVI) which related to the four seasons in 2019, urban lands, tree canopy cover to identify forest areas with trees height above 30 meters and finally the data removed from the ground and entered into the system by the user Land cover was classified into eight categories: forest land, rangeland, farmland, water, residential area, and tea farmland, garden and open space. According to the classified map of NDVI and land cover index and finally the identification of rangelands, gardens, forest lands with canopy cover less than 30%, agricultural lands and tea cultivation on the one hand and on the other hand considering the minimum area, elevation (Less than 1200 m above sea level) and slope (low to medium) required for the habitat of this species, the habitats of pheasant species in the region were identified. Then, MSPA analysis was used to form the ecological network and obtain core area. So forest land is extracted to be the foreground, and other land as the background, a series of image processing methods are used to divide the foreground into seven non-overlapping categories (namely, core, bridge, edge, branch, loop, islet and preformation), and then categories that are important for maintaining connectivity are identified, which increases the scientific nature of the ecological source and ecological corridor selection. The level of landscape connectivity in a region can quantitatively characterize whether a certain landscape type is suitable for species exchange and migration, which is of great significance for biodiversity protection and ecosystem balance. In this study, in the aspect of landscape connectivity evaluation, the integral index of connectivity (IIC), the probability of connectivity (PC), the delta of PC (dPC) and the delta of IIC (dIIC) are commonly used as the important indicators of landscape pattern and function, which can reflect well the degree of connection between core patches in the regional level and are calculated by Conefor 2. 6 software. As the dispersal ability of different species varies, we assigned the dispersal distance 3. 2 km and ring-necked pheasant, respectively. Finally, the top 8 patches with value of dPC above 4 were chosen as the most important habitats. The using least-cost path the corridors between them were determined. The least-cost path is often used to optimize a grid module. The resistance value of a grid describes its facilitating or impeding influences on dispersal processes of species. The resistance value is attached to each land cover unit to calculate the connectivity between two habitats (Table 1). The least-cost path model makes it possible to calculate the minimum cumulative link (corridors) between the target patch and the nearest source patch (habitat). We calculated the path of least resistance for the organism to migrate along and obtained the potential corridors between source patches using the "cost path" analysis in ArcGIS. The different resistance values of each land cover class were the key factors affecting the result.

The main issue of the present study is the recognition of the consequences of women’s ACCESS to water resources in thesocial STRUCTURE in part of the Central Plateau of Iran’s arid climate . This article aims to study women’s gender status in order to understand the issue of ACCESS of these social-cultural actors to water resources in the STRUCTURE. Using purposeful sampling, the required data were collected based on “Kerman State Endowment Registry” in the period of 1871-1923 with a focus on the women’s gender status and the existence of water endowment properties and some documents from the collection of the endowment trustees of the target population until reaching theoretical saturation. Data analysis follows a qualitative, inductive approach based on content analysis. The results indicate the ACCESS of Kerman’s women to water resources during the Qajar era. The findings reveal the implications of women’s ACCESS to water resources in such contexts as the “link of actor and STRUCTURE” giving women the opportunity to act and respond to the triple needs in certain frameworks.